Reconciling Distance Functions and Level Sets
نویسندگان
چکیده
منابع مشابه
Reconciling Distance Functions and Level Sets
This paper is concerned with the simulation of the Partial Diierential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher and Sethian propose to evolve the distance function with a Hamilton-Jacobi equation. Unfortunately t...
متن کاملLevel Sets and Distance Functions
This paper is concerned with the simulation of the Partial Diierential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher and Sethian propose to evolve the distance function with a Hamilton-Jacobi equation. Unfortunately t...
متن کاملMeasure-Theoretic Properties of Level Sets of Distance Functions
We consider the level sets of distance functions from the point of view of geometric measure theory. This lays the foundation for further research that can be applied, among other uses, to the derivation of a shape calculus based on the level-set method. Particular focus is put on the (n − 1)-dimensional Hausdorff measure of these level sets. We show that, starting from a bounded set, all sub-l...
متن کاملSkeletonization via Distance Maps and Level Sets
A level set approach for computing solutions to incompressible two-phase ow. A viscosity solutions approach to shape-from-shading. SIAM. 19 Proof: Every simply connected shape has a simply connected skeleton 20]. Only circles have skeletons that are single points. Therefore, the skeletons of all other simply connected shapes have at least two end points. The proof follows immediately from Lemma...
متن کاملReconciling Graphs and Sets of Sets
We explore a generalization of set reconciliation, where the goal is to reconcile sets of sets. Alice and Bob each have a parent set consisting of s child sets, each containing at most h elements from a universe of size u. They want to reconcile their sets of sets in a scenario where the total number of differences between all of their child sets (under the minimum difference matching between t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Visual Communication and Image Representation
سال: 2000
ISSN: 1047-3203
DOI: 10.1006/jvci.1999.0439